SOS Lecture 3: Sparsest cut and the ARV algorithm Boaz Barak July 1, 2014 Suggested reading Section 15.4 in the approximation algorithms book of Williamson and Shmoys (available online) for more details. See also Section

Source URL: www.boazbarak.org

3 Scientific Information 3.1

Source URL: www.ite.ethz.ch

• Computational complexity theory
• Analysis of algorithms
• Online algorithms
• Computer science
• Theory of computation
• Competitive analysis
• List update problem
• Adversary model
• Algorithm
• Randomized algorithm
• Travelling salesman problem
• Time complexity

Variable Metric Forward-Backward algorithm for minimizing the sum of a differentiable function and a convex function Emilie Chouzenoux, Jean-Christophe Pesquet and Audrey Repetti ∗

Source URL: www.optimization-online.org

Motivation Contributions A randomized online learning algorithm for better variance control

Source URL: imagine.enpc.fr

Automatic Ad Format Selection via Contextual Bandits Liang Tang School of Computer Science Florida International UnivS.W. 8th St.

Source URL: people.csail.mit.edu

• Reinforcement learning
• Greedy algorithm
• Multi-armed bandit
• Search advertising
• Prime-counting function
• Online advertising
• Statistics
• Mathematics
• Mathematical analysis

Online Discovery of Top-k Similar Motifs in Time Series Data Hoang Thanh Lam1 , Ninh Dang Pham2 and Toon Calders1 1 Department of Math. and Computer Science

Source URL: www.win.tue.nl

• Search algorithms
• Analysis of algorithms
• K-nearest neighbor algorithm
• Time complexity
• Pi
• Algorithm
• Nearest neighbor search
• Euclidean algorithm
• Theoretical computer science
• Mathematics
• Applied mathematics

Rayzit: An Anonymous and Dynamic Crowd Messaging Architecture Constantinos Costa, Chrysovalantis Anastasiou, Georgios Chatzimilioudis and Demetrios Zeinalipour-Yazti Department of Computer Science, University of Cyprus P

Source URL: www.cs.ucy.ac.cy

• Online chat
• Social information processing
• Social media
• Real-time web
• Internet culture
• Crowdsourcing
• K-nearest neighbor algorithm
• Twitter
• Peer-to-peer
• Technology
• Computing
• Computer-mediated communication

Online Make-to-Order Joint Replenishment Model: Primal Dual Competitive Algorithms N. Buchbinder∗ T. Kimbrel†

Source URL: konstantin.makarychev.net

• Linear programming
• Theoretical computer science
• Algorithm
• Mathematical optimization
• Constraint algorithm
• Decomposition method
• Operations research
• Mathematics
• Applied mathematics

MITSUBISHI ELECTRIC RESEARCH LABORATORIES http://www.merl.com A Clustering Approach to Optimize Online Dictionary Learning

Source URL: www.merl.com

• Machine learning
• Applied mathematics
• Sparse approximation
• Linguistics
• Wavelet
• Dictionary
• Algorithm
• Mathematics
• Cybernetics
• Learning

Online and Offline Selling in Limit Order Markets Kevin L. Chang1? and Aaron Johnson2?? 1 Yahoo Inc.

Source URL: www.ohmygodel.com

• Theoretical computer science
• Online algorithms
• Financial markets
• Order
• Stock market
• Randomized algorithm
• Fisher–Yates shuffle
• Algorithm
• Competitive analysis
• Mathematics
• Analysis of algorithms
• Applied mathematics